A Better Model for Task Assignment in Server Farms
نویسندگان
چکیده
منابع مشابه
Task assignment in multiple server farms using preemptive migration and flow control
Existing task assignment policies proposed for assigning tasks in stand-alone server farms are not efficient in multiple server farm environments because they have not been designed to exploit the properties of such environments.With the emergence of high speed networks and operating systems that have features such as preemptive migration, the importance of designing task assignment policies fo...
متن کاملOn Choosing a Task Assignment Policy for aDistributed Server
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve order and the task's service demand is known in advance. We consider four task assignment policies commonly proposed for such distributed server systems: Round-Robin, Random, Size-Based, in which all tasks within a give ...
متن کاملTask assignment policies in distributed server systems: A survey
Data intensive computing, in the Web environment, motivates the distributed designs of Web server systems (Web clusters) because of their scalability and cost-effectiveness instead of one Web server with high performance. The task assignment policy, in such systems, focuses on the manner of assigning the tasks that reach these systems (e.g. the case of intensive requests that reach the distribu...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملOn Choosing a Task Assignment Policy for a Distributed Server System
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve order and the task's service demand is known in advance. We consider four task assignment policies commonly proposed for such distributed server systems: RoundRobin, Random, Size-Based, in which all tasks within a give s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2016
ISSN: 0163-5999
DOI: 10.1145/2964791.2901900